Graph-based mobility profiling

Entropy-Based Privacy against Profiling of User Mobility

Location-based services (LBSs) flood mobile phones nowadays, but their use poses an evident privacy risk. The locations accompanying the LBS queries can be exploited by the LBS provider to build the user profile of visited locations, which might disclose sensitive data, such as work or home locations. The classic concept of entropy is widely used to evaluate privacy in these scenarios, where th...

Fast, accurate call graph profiling

Existing methods of for call graph profiling, such as that used by gprof, deal badly with programs that have shared subroutines, mutual recursion, higher-order functions, or dynamic method binding. This article discusses a way of improving the accuracy of a call graph profile by collecting more information during execution, without significantly increasing the overhead of profiling. The method ...

Mobility Models Mobility Metrics Connectivity Graph Connectivity Metrics Performance Metrics

Energy-Efficient Localization via Personal Mobility Profiling

Location based services are on the rise, many of which assume GPS based localization. Unfortunately, GPS incurs an unacceptable energy cost that can reduce the phone’s battery life to less than ten hours. Alternate localization technology, based on WiFi or GSM, improve battery life at the expense of localization accuracy. This paper quantifies this important tradeoff that underlies a wide range...

Synchronization Algebras with Mobility for Graph Transformations

We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for distributed and mobile computations, such as the ones used in the global computing area. We propose a graph transformation formalism in the Synchronized Hyperedge Replacement approach which is parametric w.r.t. th...